Random Games Under Elliptically Distributed Dependent Joint Chance Constraints
نویسندگان
چکیده
We study an n-player game with random payoffs and continuous strategy sets. The payoff function of each player is defined by its expected value the set a joint chance constraint. constraint vectors defining are dependent follow elliptically symmetric distributions. Archimedean copula used to capture dependence among vectors. propose reformulation player. Under mild assumptions on players’ functions 1-dimensional spherical distribution functions, we show that there exists Nash equilibrium game.
منابع مشابه
Second-order cone programming approach for elliptically distributed joint probabilistic constraints with dependent rows
In this paper, we investigate the problem of linear joint probabilistic constraints. We assume that the rows of the constraint matrix are dependent and the dependence is driven by a convenient Archimedean copula. Further we assume the distribution of the constraint rows to be elliptically distributed, covering normal, t, or Laplace distributions. Under these and some additional conditions, we p...
متن کاملAmbiguous Joint Chance Constraints Under Mean and Dispersion Information
We study joint chance constraints where the distribution of the uncertain parameters is onlyknown to belong to an ambiguity set characterized by the mean and support of the uncertaintiesand by an upper bound on their dispersion. This setting gives rise to pessimistic (optimistic)ambiguous chance constraints, which require the corresponding classical chance constraints to bes...
متن کاملProcess Optimization and Control under Chance Constraints
We propose to use chance constrained programming for process optimization and control under uncertainty. The stochastic property of the uncertainties is included in the problem formulation. The output constraints are to be ensured with a predefined confidence level. The problem is then transformed to an equivalent deterministic NLP problem. The solution of the problem has the feature of predict...
متن کاملOptimized Bonferroni Approximations of Distributionally Robust Joint Chance Constraints
A distributionally robust joint chance constraint involves a set of uncertain linear inequalities which can be violated up to a given probability threshold , over a given family of probability distributions of the uncertain parameters. A conservative approximation of a joint chance constraint, often referred to as a Bonferroni approximation, uses the union bound to approximate the joint chance ...
متن کاملIIS Cuts for Stochastic Programs with Joint Chance-Constraints
We present a new method for solving stochastic programs with joint chance constraints with discretely distributed random data. The problem can be reformulated as a large-scale mixed 0-1 integer program. We derive a new class of optimality cuts based on irreducibly infeasible subsets (IIS) of an LP defined by requiring that all scenarios be satisfied and propose a method for improving the upper ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2022
ISSN: ['0022-3239', '1573-2878']
DOI: https://doi.org/10.1007/s10957-022-02077-0